Finite-State Dimension and Real Arithmetic
نویسندگان
چکیده
We use entropy rates and Schur concavity to prove that, for every integer k ≥ 2, every nonzero rational number q, and every real number α, the base-k expansions of α, q + α, and qα all have the same finite-state dimension and the same finitestate strong dimension. This extends, and gives a new proof of, Wall’s 1949 theorem stating that the sum or product of a nonzero rational number and a Borel normal number is always Borel normal.
منابع مشابه
Self-similar fractals and arithmetic dynamics
The concept of self-similarity on subsets of algebraic varieties is defined by considering algebraic endomorphisms of the variety as `similarity' maps. Self-similar fractals are subsets of algebraic varieties which can be written as a finite and disjoint union of `similar' copies. Fractals provide a framework in which, one can unite some results and conjectures in Diophantine g...
متن کاملOn the arithmetic dimension of triangle groups
Let ∆ = ∆(a, b, c) be a hyperbolic triangle group, a Fuchsian group obtained from reflections in the sides of a triangle with angles π/a, π/b, π/c drawn on the hyperbolic plane. We define the arithmetic dimension of ∆ to be the number of split real places of the quaternion algebra generated by ∆ over its (totally real) invariant trace field. Takeuchi has determined explicitly all triples (a, b,...
متن کاملAn Effective Decision Procedure for Linear Arithmetic with Integer and Real Variables
This paper considers finite-automata based algorithms for handling linear arithmetic with both real and integer variables. Previous work has shown that this theory can be dealt with by using finite automata on infinite words, but this involves some difficult and delicate to implement algorithms. The contribution of this paper is to show, using topological arguments, that only a restricted class...
متن کاملOn the Use of Weak Automata for Deciding Linear Arithmetic with Integer and Real Variables
This paper considers finite-automata based algorithms for handling linear arithmetic with both real and integer variables. Previous work has shown that this theory can be dealt with by using finite automata on infinite words, but this involves some difficult and delicate to implement algorithms. The contribution of this paper is to show, using topological arguments, that only a restricted class...
متن کاملGeneralized Property Directed Reachability
The IC3 algorithm was recently introduced for proving properties of finite state reactive systems. It has been applied very successfully to hardware model checking. We provide a specification of the algorithm using an abstract transition system and highlight its dual operation: model search and conflict resolution. We then generalize it along two dimensions. Along one dimension we address nonli...
متن کامل